ar X iv : c s / 99 10 00 1 v 1 [ cs . C C ] 1 O ct 1 99 9 Fixed - Parameter Tractability and Logic

ar X iv : c s / 99 08 00 6 v 1 [ cs . C G ] 1 1 A ug 1 99 9 Computational Geometry Column 36

Two results in “computational origami” are illustrated. Computational geometry has recently been applied to solve two open problems in “origami mathematics.”

ar X iv : c ha o - dy n / 99 10 00 5 v 1 6 O ct 1 99 9 The Finite - Difference Analysis and Time Flow

ar X iv : f un ct - a n / 97 07 00 9 v 1 2 8 Ju l 1 99 7 One - parameter representations on C ∗ - algebras

Strongly continuous one-parameter representations on a C *-algebra A and their extension to the multiplier algebra are investigated. We also give a proof of the Stone theorem on Hilbert C *-modules and look into some related problems.

ar X iv : h ep - l at / 9 71 00 37 v 1 9 O ct 1 99 7 1

We compute the lower moments of the structure functions of π and ρ. Of particular interest are the spin-dependent structure functions of the ρ as they give new information about quark binding effects.

ar X iv : c s / 01 10 03 8 v 1 [ cs . C C ] 1 8 O ct 2 00 1 Counting Is Easy †

For any fixed k, a remarkably simple single-tape Turing machine can simulate k independent counters in real time.